Broadcasting on Faulty Hypercubes
نویسندگان
چکیده
In this paper we propose a method for constructing the maximum number of edge-disjoint spanning trees (in the directed sense) on a hypercube with arbitrary one faulty node. Each spanning tree is of optimal height. By taking the common neighbor of the roots of these edge-disjoint spanning trees as the new root and reversing the direction of the directed link from each root to the new root, a spanning graph, consisting of n 1 edge-disjoint spanning trees, of optimal height is formed. Broadcasting based on the spanning graph has an optimal bandwidth utilization and an optimal latency. Index Terms --Broadcasting, edge-disjoint spanning trees, automorphism, dimension permutation, hypercubes.
منابع مشابه
An Optimal d−1-Fault-Tolerant Broadcasting Scheme for d-Dimensional Hypercubes
Broadcasting is the process of information dissemination in a communication network in which a message, originated by one member, is transmitted to all members of the network. We propose a k-fault-tolerant broadcasting scheme for a faulty d-dimensional hypercube where 0≤ k<d. For the whispering model, the new scheme requires 2d time units that are optimal for faulty-hypercubes. Moreover, it onl...
متن کاملOptimal broadcasting in hypercubes with link faults using limited global information
We propose a fault-tolerant broadcasting algorithm for hypercubes with link faults. This algorithm is based on an extended spanning binomial tree structure that still keeps the simplicity of conventional binomial-tree-based broadcasting. In addition, it is optimal in the sense that exactly n steps are required to complete a broadcast in an n-dimensional injured hypercube with up to n 2 faulty l...
متن کاملLocal-Safety-Information-Based Fault-Tolerant Broadcasting in Hypercubes
This paper presents a method for fault-tolerant broadcasting in faulty hypercubes using a new metric called local safety. A new concept of the broadcast subcube is introduced, based on which various techniques are proposed to improve the performance of a broadcast algorithm. An unsafe hypercube can be split into a set of maximal safe subcubes. We show that if these maximal safe subcubes meet ce...
متن کاملOn Some Global Operations in Faulty SIMD Hypercubes
In this paper we extend our prior results to obtain algorithms for performing all-to-all broadcast, global sum and broadcast operation in an N = 2 node n dimensional faulty SIMD hypercube, Qn, (n 9) with the number of faults n 1 < f 2n 3 . We also discuss optimal algorithms for one-to-all personalized broadcasting and all-toone personalized broadcasting in a Qn with the number of faults f n 1. ...
متن کاملReliable Unicasting in Faulty Hypercubes Using Safety Levels
We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes and unicasting is a one-to-one communication between two nodes in the hypercube. Each node is associated with a safety level which is an approximated measure of the number and distribution of faulty nodes in the neighborh...
متن کامل